Pair Connectedness and Shortest Path Scaling in Critical Percolation
نویسنده
چکیده
We present high statistics data on the distribution of shortest path lengths between two near-by points on the same cluster at the percolation threshold. Our data are based on a new and very efficient algorithm. For d = 2 they clearly disprove a recent conjecture by M. Porto et al., Phys. Rev. E 58, R5205 (1998). Our data also provide upper bounds on the probability that two near-by points are on different infinite clusters.
منابع مشابه
A critical exponent for shortest-path scaling in continuum percolation
We carry out Monte Carlo experiments to study the scaling behavior of shortest path lengths in continuum percolation. These studies suggest that the critical exponent governing this scaling is the same for both continuum and lattice percolation. We use splitting, a technique that has not yet been fully exploited in the physics literature, to increase the speed of our simulations. This technique...
متن کاملThe fractal dimension of the minimum path in two - and three - dimensional percolation
We calculate the fractal dimension d, , , of the shortest path I between two points on a percolation cluster, where 1 rd”n and r is the Pythagorean distance between the points. We find d , , ,= 1.130*0.002 for d = 2 and 1.34i0.01 for d =3 . What is the length 1 of the shortest path or ‘chemical distance’ between two points of a random material? In general, I is greater than r, the Pythagorean d...
متن کاملGhost fields, pair connectedness, and scaling: exact results in one-dimensional percolation
The percolation problem is solved exactly in one dimension. The functions obtained bear a strong resemblance to those of the n-vector model on the same lattice. Further, we include a ghost field exactly in all dimensions d, thereby treating the ‘thermodynamics’ of percolation without appealing to the Potts model. In particular, we show for d = 1 that the nature of the singularities near the cri...
متن کاملBridge Percolation
In bridge percolation one gives a special weight to bridges, i.e., bonds that if occupied would create the first spanning cluster. We show that, for p > pc, even far away from the critical point of classical percolation, the set of bridge bonds is fractal with a fractal dimension dBB = 1.215±0.002. This new percolation exponent is related to various different models like, e.g., the optimal path...
متن کاملTHE SCALING LAW FOR THE DISCRETE KINETIC GROWTH PERCOLATION MODEL
The Scaling Law for the Discrete Kinetic Growth Percolation Model The critical exponent of the total number of finite clusters α is calculated directly without using scaling hypothesis both below and above the percolation threshold pc based on a kinetic growth percolation model in two and three dimensions. Simultaneously, we can calculate other critical exponents β and γ, and show that the scal...
متن کامل